Irreducibility is Minimum Synergy Among Parts
نویسندگان
چکیده
For readers already familiar with Partial Information Decomposition (PID), we show that PID’s definition of synergy enables quantifying at least four different notions of irreducibility. First, we show four common notions of “parts” give rise to a spectrum of four distinct measures of irreducibility. Second, we introduce a nonnegative expression based on PID for each notion of irreducibility. Third, we delineate these four notions of irreducibility with exemplary binary circuits. This work will become more useful once the complexity community has converged on a palatable I∩ or I∪ measure.
منابع مشابه
The criterion of irreducibility of multi – loop
The criterion of irreducibility of multi–loop Feynman integrals. Abstract The integration by parts recurrence relations allow to reduce some Feynman inte-grals to more simple ones (with some lines missing). Nevertheless the possibility of such reduction for the given particular integral was unclear. The recently proposed technique for studying the recurrence relations as by-product provides wit...
متن کاملA Principled Infotheoretic \phi-like Measure
Integrated information theory [1–3] is a mathematical, quantifiable theory of conscious experience. The linchpin of this theory, the φ measure, quantifies a system’s irreducibility to disjoint parts. Purely as a measure of irreducibility, we pinpoint three concerns about φ and propose a revised measure, ψ, which addresses them. Our measure ψ is rigorously grounded in Partial Information Decompo...
متن کاملOn the irreducibility of the complex specialization of the representation of the Hecke algebra of the complex reflection group $G_7$
We consider a 2-dimensional representation of the Hecke algebra $H(G_7, u)$, where $G_7$ is the complex reflection group and $u$ is the set of indeterminates $u = (x_1,x_2,y_1,y_2,y_3,z_1,z_2,z_3)$. After specializing the indetrminates to non zero complex numbers, we then determine a necessary and sufficient condition that guarantees the irreducibility of the complex specialization of the repre...
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملPerron-Frobenius Type Results on the Numerical Range
We present results connecting the shape of the numerical range to intrinsic properties of a matrix A. When A is a nonnegative matrix, these results are to a large extent analogous to the Perron-Frobenius theory, especially as it pertains to irreducibility and cyclicity in the combinatorial sense. Special attention is given to polygonal, circular and elliptic numerical ranges. The main vehicles ...
متن کامل